Speeding up Spatial Database Query Execution using GPUs
نویسندگان
چکیده
منابع مشابه
Speeding up Spatial Database Query Execution using GPUs
Spatial databases are used in a wide variety of real-world applications, such as land surveying, urban planning, and environmental assessments, as well as geospatial Web services. As uses of spatial databases become more widespread, there is a growing need for good performance of spatial applications. In spatial workloads, queries tend to be computationally-intensive due to the complex processi...
متن کاملSpeeding Up Evolutionary Learning Algorithms using GPUs
This paper propose a multithreaded Genetic Programming classification evaluation model using NVIDIA CUDA GPUs to reduce the computational time due to the poor performance in large problems. Two different classification algorithms are benchmarked using UCI Machine Learning data sets. Experimental results compare the performance using single and multithreaded Java, C and GPU code and show the eff...
متن کاملSpeeding Up Algorithmic Debugging Using Balanced Execution Trees
Algorithmic debugging is a debugging technique that uses a data structure representing all computations performed during the execution of a program. This data structure is the so-called Execution Tree and it strongly influences the performance of the technique. In this work we present a transformation that automatically improves the structure of the execution trees by collapsing and projecting ...
متن کاملCascaded Execution: Speeding Up Unparallelized Execution on Shared-Memory Multiprocessors
Both inherently sequential code and limitations of analysis techniques prevent full parallelization of many applications by parallelizing compilers. Amdahl’s Law tells us that as parallelization becomes increasingly effective, any unparallelized loop becomes an increasingly dominant performance bottleneck. We present a technique for speeding up the execution of unparallelized loops by cascading...
متن کاملDistributed query execution system for Transactional Database using Lookup Table
As data volumes are incrementing rigorously, it is essential to store such large amount of data distributed across many machines. In OLTP databases, the most common strategy for scaling database workload is to horizontally partition the database using hash or range partitioning. It works well in many simple applications such as an email application. Transactions that access few tuples do not ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2012
ISSN: 1877-0509
DOI: 10.1016/j.procs.2012.04.205